DFA minimization: Double reversal versus split minimization algorithms
نویسندگان
چکیده
منابع مشابه
A Parallel DFA Minimization Algorithm
In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in Σ of the DFA to be minimized, the algorithm runs in O(kn log n) time and uses O( n log n ) processors.
متن کاملFast brief practical DFA minimization
Article history: Received 27 May 2011 Received in revised form 2 December 2011 Accepted 5 December 2011 Available online 7 December 2011 Communicated by J. Torán
متن کاملThe Myhill-Nerode Theorem and DFA Minimization
The DFA model of computation has explicit state names for every possible state that a machine might be in. Nevertheless, when writing programs, although we do think about the different states that a program might be in, we do not explicitly label them. We now consider how to identify machine states associated with a language L merely by identifying a particular relationship between strings in L...
متن کاملA polynomial double reversal minimization algorithm for deterministic finite automata
We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity. © 2013 Elsevier B.V. All rights reserved.
متن کاملDescription and analysis of a bottom-up DFA minimization algorithm
We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this proced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.002